Second-order symmetric duality with cone constraints
نویسندگان
چکیده
منابع مشابه
Duality for second-order symmetric multiobjective programming with cone constraints
In this paper, a new pair of Mond-Weir type multiobjective second-order symmetric dual models with cone constraints is formulated in which the objective function is optimised with respect to an arbitrary closed convex cone. Usual duality relations are further established under K-η-bonvexity/second-order symmetric dual K-H-convexity assumptions. A nontrivial example has also been illustrated to ...
متن کاملOn multiobjective second order symmetric duality with cone constraints
Article history: Received 10 October 2007 Accepted 24 August 2009 Available online 15 September 2009
متن کاملMultiobjective second order symmetric duality with cone constraints
Abstract. We introduce two pairs of nondifferentiable multiobjective second order symmetric dual problems with cone constraints over arbitrary closed convex cones, which is different from the one proposed by Mishra and Lai [12]. Under suitable second order pseudo-invexity assumptions we establish weak, strong and converse duality theorems as well as self-duality relations. Our symmetric duality...
متن کاملNondifferentiable multiobjective second-order symmetric duality
⎯In this paper, we construct a pair of Mond-Weir type second order symmetric dual problems, in which the objective function contains support function and is, therefore, nondifferentiable. For this pair of problems, we validate weak, strong and converse duality theorems under pseudobonvexity – pseudoboncavity assumption on the kernel function that appears in the problems. A second order self dua...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.08.021